The Parallel Complexity of Approximating the High Degree Subgraph Problem
نویسندگان
چکیده
The HIGH DEGREE SUBGRAPH problem is to find a subgraph H of a graph G such that the minimum degree of H is as large as possible. This problem is known to be P-hard so that parallel approximation algorithms are very important for it. Our first goal is to determine how effectively the approximation algorithm based on a well-known extremal graph result parallelizes. In particular, we show that two natural decision problems associated with this algorithm are P-complete: these results suggest that the parallel implementation of the algorithm itself requires more sophisticated techniques. Successively, we study the HIGH DEGREE SUEIGRAPH problem for random graphs with any edge probability function and we provide different parallel approximation algorithms depending on the type of this function. @ 1998-Elsevier Science B.V. All rights reserved
منابع مشابه
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
Competitive Searching in Polygons Beyond Generalised Streets p. 32 Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas p. 42 Logspace Verifiers, NC, and NP p. 52 Structure in Average Case Complexity p. 62 Some Geometric Lower Bounds p. 72 The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation p. 82 Two Arc Disjoint Paths in Eulerian Diagraphs p. 92 Findin...
متن کاملOn Maximum Common Subgraph Problems in Series-Parallel Graphs
The complexity of the maximum common connected subgraph problem in partial k-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial 2-trees. On the contrary, the problem is known to be NP-hard in vertex-labeled partial 11-trees of bounded degree. We consider series-parallel graphs, i.e., partial 2-trees. We show ...
متن کاملOn the densest k-subgraph problem
Given an n-vertex graph G and a parameter k, we are to nd a k-vertex subgraph with the maximum number of edges. This problem is N P-hard. We show that the problem remains N P-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any > 0 nds a k-vertex subgraph with at least (1 ?) ? k 2 edges, in time n O((1+log n k)==). We study the applicabi...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملApproximating Bounded Degree Maximum Spanning Subgraphs∗
The bounded degree maximum spanning subgraph problem arising from wireless mesh networks is studied here. Given a connected graph G and a positive integer d ≥ 2, the problem aims to find a maximum spanning subgraph H of G with the constraint: for every vertex v of G, the degree of v in H, dH(v), is less than or equal to d. Here, a spanning subgraph is a connected subgraph which contains all the...
متن کامل